A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

辐射传热时活塞式气缸中加热气体的最大膨胀功

对热辐射传热定律q∝Δ(T4)下,给定初态内能、体积,末态体积以及过程时间时,加热气体膨胀的最优构型进行了研究,利用最优控制理论得出最大膨胀功输出时膨胀的最优构型由两个瞬时绝热分支和一个E-L分支组成的结论.给出了各分支之间转换点参数的求解方法及最优构型的数值算例,最后将线性唯象传热定律、牛顿传热定律、平方传热定律、立方传热定律和辐射传热定律下加热气体膨胀的最优构型进行了比较.结果显示,随着传热指数的增加,理想气体的内能呈现出明显的整体增加趋势,而体积则呈现出明显的整体减小趋势.     

提高“两课”教学的生动性三议

提高“两课”教学的生动性，就要在备课和讲课时，注重追求思想上的深刻、资料上的精彩和语言上的震撼与精美。力求思想深刻，内容精彩，语言精美。     

编译型PROLOG系统的若干优化实现技术

文中论述可应用于设计编译型Prolog系统的若干优化实现技术。这些技术包括:执行驱动编译策略,代码分类以及数据库操作内部谓词的操作模式。     

分组坐标轮换法与机械优化设计

minimax 问题是工程优化设计中普遍存在的问题。本文首次采用分组坐标轮换法求解该问题,通过分析获得了该算法收敛的充分条件(如果收敛,还可计算最大轮换次数)。一些数值计算验证了文中的结论,本文还把该算法用于四连杆实现函数机构的优化设计.     

最佳（n,2,w）二进制等重检错码的研究

本文研究了最佳(n,2,w)二进制等重检错码的存在性问题。对于文[5]中n 为偶数时所得的结论,本文给了一个简练的证明。更为重要的是,利用以上方法,作者证明了文[5]中关于n 为奇数时的一个猜想。     

H 面双填充介质金属方波导的本征模

通过求解Ｈ面双填充介质金属方波导中位函数的亥姆霍兹方程,得到系统的电磁波的本征模函数及本征值方程,其本征模为ＬＳＥ模或ＬＳＭ模,并给出了色散关系的数值解。     

自由后坐式自动武器运动系统优化设计研究

本文介绍自由抢机式自动武器运动系统有关结构参量的一种优化设计方法。优化的目标函数为自动机后坐到位速度和弹丸的初速。优化的结构参数有自动机的质量,弹簧的抗力等。     

舰炮瞄准角速度和角加速度的定量分析

从舰炮火控原理出发,用坐标转换技术和微分理论,推导了在二轴和三轴稳定情况下,火炮瞄准的角速度和角加速度公式,并讨论了跟踪器的有关情况,给出了计算实例和主要结论。